Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
نویسندگان
چکیده
This paper considers a class of simultaneous optimization scheduling with two competitive agents on an unbounded serial-batching machine. The cost function each agent depends the completion times its jobs only. According to whether from different can be processed in common batch, compatible model and incompatible are investigated. For model, we consider batch availability item availability. problem, provide polynomial-time algorithm that find all Pareto optimal schedules.
منابع مشابه
A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملCoordinated scheduling on single serial batching machine with transportation considerations
The coordination of production scheduling and transportation has recently received a lot of attention in logistics and supply chain management. We study a coordinated scheduling problem, in which each job is transported to a single serial batching machine for further processing, each batch to be processed occurs a processing cost, and the objective is minimizing the sum of the makespan and the ...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملScheduling an unbounded batching machine with family jobs and setup times
We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different fa...
متن کاملTwo-Machine Flowshop Batching and Scheduling
We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The forming of each batch on the second machine incurs a constant setup time. The objective is to minimize the makespan. This problem was previously shown to be NP-hard in the ordinary sense. In this paper, we first presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2021175